Combinatorial BLAS 2.0: Scaling Combinatorial Algorithms on Distributed-Memory Systems

Combinatorial algorithms such as those that arise in graph analysis, modeling of discrete systems, bioinformatics, and chemistry, are often hard to parallelize. The BLAS library implements key computational primitives for rapid development combinatorial distributed-memory systems. During the decade since its first introduction, has evolved expanded significantly. This article details many technical features version 2.0, communication avoidance, hierarchical parallelism via in-node multithreading, accelerator support GPU kernels, generalized semiring support, implementations data structures functions, scalable distributed I/O operations human-readable files. Our also presents several rules thumb choosing right functions under various common application scenarios.